The lattice-ordered groups of automorphisms of an ordered set.

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Amalgamations of Lattice Ordered Groups

The author considers the problem of determining whether certain classes of lattice ordered groups (¿-groups) have the amalgamation property. It is shown that the classes of abelian totally ordered groups (ogroups) and abelian /-groups have the property, but that the class of ¿-groups does not. However, under certain cardinality restrictions one can find an ¿-group which is the "product" of /-gr...

متن کامل

Convex $L$-lattice subgroups in $L$-ordered groups

In this paper, we have focused to study convex $L$-subgroups of an $L$-ordered group. First, we introduce the concept of a convex $L$-subgroup and a convex $L$-lattice subgroup of an $L$-ordered group and give some examples. Then we find some properties and use them to construct convex $L$-subgroup generated by a subset $S$ of an $L$-ordered group $G$ . Also, we generalize a well known result a...

متن کامل

Lattice-ordered reduced special groups

Special groups [M. Dickmann, F. Miraglia, Special Groups : Boolean-Theoretic Methods in the Theory of Quadratic Forms, Memoirs Amer. Math. Soc., vol. 689, Amer. Math. Soc., Providence, RI, 2000] are a first-order axiomatization of the theory of quadratic forms. In Section 2 we investigate reduced special groups (RSG) which are a lattice under their natural representation partial order (for moti...

متن کامل

Free abelian lattice-ordered groups

Let n be a positive integer and FA`(n) be the free abelian latticeordered group on n generators. We prove that FA`(m) and FA`(n) do not satisfy the same first-order sentences in the language L={+,−, 0,∧,∨} if m 6= n. We also show that Th(FA`(n)) is decidable iff n ∈ {1, 2}. Finally, we apply a similar analysis and get analogous results for the free finitely generated vector lattices. A. M. S. C...

متن کامل

The Lattice of Completions of an Ordered Set

For any ordered set P, the join dense completions of P form a complete lattice K(P) with least element O(P), the lattice of order ideals of P, and greatest element M(P), the Dedekind-MacNeille completion of P. The lattice K(P) is isomorphic to an ideal of the lattice of all closure operators on the lattice O(P). Thus it inherits some local structural properties which hold in the lattice of clos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Michigan Mathematical Journal

سال: 1963

ISSN: 0026-2285

DOI: 10.1307/mmj/1028998976